Vertex Splitting, Coincident Realisations, and Global Rigidity of Braced Triangulations
نویسندگان
چکیده
We give a relatively short graph theoretic proof of result Jordán and Tanigawa that 4-connected which has spanning plane triangulation as proper subgraph is generically globally rigid in $${\mathbb {R}}^3$$ . Our based on new sufficient condition for the so called vertex splitting operation to preserve generic global rigidity {R}}^d$$
منابع مشابه
Braced edges in plane triangulations
A plane triangulation is an embedding of a maximal planar graph in the Euclidean plane. Foulds and Robinson (1979) first studied the problem of transforming one triangulation to another by a sequence of diagonal operations. where a diagonal operation deletes one edge and inserts the other diagonal of the resulting quadrilateral face. An edge which cannot be removed by a single diagonal operatio...
متن کاملPreprocessing Imprecise Points and Splitting Triangulations
Traditional algorithms in computational geometry assume that the input points are given precisely. In practice, data is usually imprecise, but information about the imprecision is often available. In this context, we investigate what the value of this information is. We show here how to preprocess a set of disjoint regions in the plane of total complexity n in O(n logn) time so that if one poin...
متن کاملCounting 1-vertex triangulations of oriented surfaces
A 1−vertex triangulation of an oriented compact surface S of genus g is an embedded graph T ⊂ S with a unique vertex such that all connected components of S \ T are triangles (adjacent to exactly 3 edges of T ). This paper gives formulas enumerating such triangulations (up to equivalence) on an oriented surface of given genus. Une triangulation à un sommet d’une surface orientée compacte S de g...
متن کاملVertex Deletion for 3D Delaunay Triangulations
We show how to delete a vertex q from a three-dimensional Delaunay triangulation DT(S) in expected O(C⊗(P )) time, where P is the set of vertices neighboring q in DT(S) and C⊗(P ) is an upper bound on the expected number of tetrahedra whose circumspheres enclose q that are created during the randomized incremental construction of DT(P ). Experiments show that our approach is significantly faste...
متن کاملTensegrities and Global Rigidity
A tensegrity is finite configuration of points in Ed suspended rigidly by inextendable cables and incompressable struts. Here it is explained how a stress-energy function, given by a symmetric stress matrix, can be used to create tensegrities that are globally rigid in the sense that the only configurations that satisfy the cable and strut constraints are congruent copies.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete and Computational Geometry
سال: 2022
ISSN: ['1432-0444', '0179-5376']
DOI: https://doi.org/10.1007/s00454-022-00459-9